A characterization of even order trees with domination number half their order minus one
نویسندگان
چکیده
We consider finite graphs G with vertex set V (G). A subset D ⊆ V (G) is a dominating set of the graph G, if every vertex v ∈ V (G) − D is adjacent to at least one vertex in D. The domination number γ(G) is the minimum cardinality among the dominating sets of G. In this note, we characterize the trees T with an even number of vertices such that γ(T ) = |V (T )| − 2
منابع مشابه
A characterization relating domination, semitotal domination and total Roman domination in trees
A total Roman dominating function on a graph $G$ is a function $f: V(G) rightarrow {0,1,2}$ such that for every vertex $vin V(G)$ with $f(v)=0$ there exists a vertex $uin V(G)$ adjacent to $v$ with $f(u)=2$, and the subgraph induced by the set ${xin V(G): f(x)geq 1}$ has no isolated vertices. The total Roman domination number of $G$, denoted $gamma_{tR}(G)$, is the minimum weight $omega(f)=sum_...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملOuter independent Roman domination number of trees
A Roman dominating function (RDF) on a graph G=(V,E) is a function f : V → {0, 1, 2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. An RDF f is calledan outer independent Roman dominating function (OIRDF) if the set ofvertices assigned a 0 under f is an independent set. The weight of anOIRDF is the sum of its function values over ...
متن کاملA characterization of trees with equal Roman 2-domination and Roman domination numbers
Given a graph $G=(V,E)$ and a vertex $v in V$, by $N(v)$ we represent the open neighbourhood of $v$. Let $f:Vrightarrow {0,1,2}$ be a function on $G$. The weight of $f$ is $omega(f)=sum_{vin V}f(v)$ and let $V_i={vin V colon f(v)=i}$, for $i=0,1,2$. The function $f$ is said to bebegin{itemize}item a Roman ${2}$-dominating function, if for every vertex $vin V_0$, $sum_{uin N(v)}f(u)geq 2$. The R...
متن کاملCo-Roman domination in trees
Abstract: Let G=(V,E) be a graph and let f:V(G)→{0,1,2} be a function. A vertex v is protected with respect to f, if f(v)>0 or f(v)=0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function, abbreviated CRDF if: (i) every vertex in V is protected, and (ii) each u∈V with positive weight has a neighbor v∈V with f(v)=0 such that the func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 44 شماره
صفحات -
تاریخ انتشار 2009